TSTP Solution File: NLP267^4 by Vampire---4.8
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : Vampire---4.8
% Problem : NLP267^4 : TPTP v8.2.0. Released v8.1.0.
% Transfm : none
% Format : tptp:raw
% Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% Computer : n020.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Tue May 21 01:03:34 EDT 2024
% Result : Theorem 0.21s 0.38s
% Output : Refutation 0.21s
% Verified :
% SZS Type : Refutation
% Derivation depth : 14
% Number of leaves : 27
% Syntax : Number of formulae : 93 ( 44 unt; 16 typ; 0 def)
% Number of atoms : 411 ( 76 equ; 0 cnn)
% Maximal formula atoms : 10 ( 5 avg)
% Number of connectives : 405 ( 21 ~; 31 |; 10 &; 301 @)
% ( 3 <=>; 29 =>; 0 <=; 0 <~>)
% Maximal formula depth : 8 ( 2 avg)
% Number of types : 3 ( 1 usr)
% Number of type conns : 74 ( 74 >; 0 *; 0 +; 0 <<)
% Number of symbols : 24 ( 20 usr; 11 con; 0-3 aty)
% ( 10 !!; 0 ??; 0 @@+; 0 @@-)
% Number of variables : 80 ( 67 ^ 13 !; 0 ?; 80 :)
% Comments :
%------------------------------------------------------------------------------
thf(type_def_5,type,
mworld: $tType ).
thf(func_def_0,type,
mworld: $tType ).
thf(func_def_1,type,
mrel: mworld > mworld > $o ).
thf(func_def_2,type,
mactual: mworld ).
thf(func_def_3,type,
mlocal: ( mworld > $o ) > $o ).
thf(func_def_5,type,
mnot: ( mworld > $o ) > mworld > $o ).
thf(func_def_6,type,
mand: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_7,type,
mor: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_8,type,
mimplies: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_9,type,
mequiv: ( mworld > $o ) > ( mworld > $o ) > mworld > $o ).
thf(func_def_10,type,
mbox: ( mworld > $o ) > mworld > $o ).
thf(func_def_11,type,
mdia: ( mworld > $o ) > mworld > $o ).
thf(func_def_17,type,
price: $i > mworld > $o ).
thf(func_def_18,type,
dest: $i > mworld > $o ).
thf(func_def_19,type,
class: $i > mworld > $o ).
thf(func_def_34,type,
sK1: mworld ).
thf(f177,plain,
$false,
inference(avatar_sat_refutation,[],[f152,f158,f167,f176]) ).
thf(f176,plain,
( ~ spl0_1
| spl0_3 ),
inference(avatar_contradiction_clause,[],[f175]) ).
thf(f175,plain,
( $false
| ~ spl0_1
| spl0_3 ),
inference(subsumption_resolution,[],[f171,f149]) ).
thf(f149,plain,
( ( ( mrel @ mactual @ sK1 )
!= $false )
| spl0_3 ),
inference(avatar_component_clause,[],[f148]) ).
thf(f148,plain,
( spl0_3
<=> ( ( mrel @ mactual @ sK1 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_3])]) ).
thf(f171,plain,
( ( ( mrel @ mactual @ sK1 )
= $false )
| ~ spl0_1 ),
inference(trivial_inequality_removal,[],[f170]) ).
thf(f170,plain,
( ( $true = $false )
| ( ( mrel @ mactual @ sK1 )
= $false )
| ~ spl0_1 ),
inference(superposition,[],[f101,f142]) ).
thf(f142,plain,
( ( ( dest @ paris @ sK1 )
= $false )
| ~ spl0_1 ),
inference(avatar_component_clause,[],[f140]) ).
thf(f140,plain,
( spl0_1
<=> ( ( dest @ paris @ sK1 )
= $false ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_1])]) ).
thf(f101,plain,
! [X1: mworld] :
( ( $true
= ( dest @ paris @ X1 ) )
| ( ( mrel @ mactual @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f100]) ).
thf(f100,plain,
! [X1: mworld] :
( $true
= ( ( mrel @ mactual @ X1 )
=> ( dest @ paris @ X1 ) ) ),
inference(beta_eta_normalization,[],[f99]) ).
thf(f99,plain,
! [X1: mworld] :
( ( ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( dest @ paris @ Y0 ) )
@ X1 )
= $true ),
inference(pi_clausification,[],[f98]) ).
thf(f98,plain,
( $true
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( dest @ paris @ Y0 ) ) ) ),
inference(beta_eta_normalization,[],[f73]) ).
thf(f73,plain,
( $true
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ ( dest @ paris ) ) ) ),
inference(definition_unfolding,[],[f57,f69,f60]) ).
thf(f60,plain,
( mbox
= ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) ) ) ),
inference(cnf_transformation,[],[f45]) ).
thf(f45,plain,
( mbox
= ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) ) ) ),
inference(fool_elimination,[],[f44]) ).
thf(f44,plain,
( mbox
= ( ^ [X0: mworld > $o,X1: mworld] :
! [X2: mworld] :
( ( mrel @ X1 @ X2 )
=> ( X0 @ X2 ) ) ) ),
inference(rectify,[],[f7]) ).
thf(f7,axiom,
( mbox
= ( ^ [X0: mworld > $o,X2: mworld] :
! [X4: mworld] :
( ( mrel @ X2 @ X4 )
=> ( X0 @ X4 ) ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mbox_def) ).
thf(f69,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(cnf_transformation,[],[f50]) ).
thf(f50,plain,
( mlocal
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual ) ) ),
inference(fool_elimination,[],[f1]) ).
thf(f1,axiom,
( mlocal
= ( ^ [X0: mworld > $o] : ( X0 @ mactual ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mlocal_def) ).
thf(f57,plain,
( ( mlocal @ ( mbox @ ( dest @ paris ) ) )
= $true ),
inference(cnf_transformation,[],[f27]) ).
thf(f27,plain,
( ( mlocal @ ( mbox @ ( dest @ paris ) ) )
= $true ),
inference(fool_elimination,[],[f26]) ).
thf(f26,plain,
mlocal @ ( mbox @ ( dest @ paris ) ),
inference(rectify,[],[f15]) ).
thf(f15,axiom,
mlocal @ ( mbox @ ( dest @ paris ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief1) ).
thf(f167,plain,
~ spl0_3,
inference(avatar_contradiction_clause,[],[f166]) ).
thf(f166,plain,
( $false
| ~ spl0_3 ),
inference(trivial_inequality_removal,[],[f159]) ).
thf(f159,plain,
( ( $true = $false )
| ~ spl0_3 ),
inference(superposition,[],[f150,f106]) ).
thf(f106,plain,
( ( mrel @ mactual @ sK1 )
= $true ),
inference(binary_proxy_clausification,[],[f104]) ).
thf(f104,plain,
( ( ( mrel @ mactual @ sK1 )
=> ( price @ seventy @ sK1 ) )
= $false ),
inference(beta_eta_normalization,[],[f103]) ).
thf(f103,plain,
( ( ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( price @ seventy @ Y0 ) )
@ sK1 )
= $false ),
inference(sigma_clausification,[],[f102]) ).
thf(f102,plain,
( $true
!= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( price @ seventy @ Y0 ) ) ) ),
inference(beta_eta_normalization,[],[f74]) ).
thf(f74,plain,
( ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ ( price @ seventy ) ) )
!= $true ),
inference(definition_unfolding,[],[f59,f69,f60]) ).
thf(f59,plain,
( ( mlocal @ ( mbox @ ( price @ seventy ) ) )
!= $true ),
inference(cnf_transformation,[],[f53]) ).
thf(f53,plain,
( ( mlocal @ ( mbox @ ( price @ seventy ) ) )
!= $true ),
inference(flattening,[],[f41]) ).
thf(f41,plain,
( ( mlocal @ ( mbox @ ( price @ seventy ) ) )
!= $true ),
inference(fool_elimination,[],[f40]) ).
thf(f40,plain,
~ ( mlocal @ ( mbox @ ( price @ seventy ) ) ),
inference(rectify,[],[f18]) ).
thf(f18,negated_conjecture,
~ ( mlocal @ ( mbox @ ( price @ seventy ) ) ),
inference(negated_conjecture,[],[f17]) ).
thf(f17,conjecture,
mlocal @ ( mbox @ ( price @ seventy ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',con) ).
thf(f150,plain,
( ( ( mrel @ mactual @ sK1 )
= $false )
| ~ spl0_3 ),
inference(avatar_component_clause,[],[f148]) ).
thf(f158,plain,
( spl0_3
| ~ spl0_2 ),
inference(avatar_split_clause,[],[f155,f144,f148]) ).
thf(f144,plain,
( spl0_2
<=> ( $false
= ( class @ second @ sK1 ) ) ),
introduced(avatar_definition,[new_symbols(naming,[spl0_2])]) ).
thf(f155,plain,
( ( ( mrel @ mactual @ sK1 )
= $false )
| ~ spl0_2 ),
inference(trivial_inequality_removal,[],[f154]) ).
thf(f154,plain,
( ( ( mrel @ mactual @ sK1 )
= $false )
| ( $true = $false )
| ~ spl0_2 ),
inference(superposition,[],[f116,f146]) ).
thf(f146,plain,
( ( $false
= ( class @ second @ sK1 ) )
| ~ spl0_2 ),
inference(avatar_component_clause,[],[f144]) ).
thf(f116,plain,
! [X1: mworld] :
( ( $true
= ( class @ second @ X1 ) )
| ( ( mrel @ mactual @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f115]) ).
thf(f115,plain,
! [X1: mworld] :
( ( ( mrel @ mactual @ X1 )
=> ( class @ second @ X1 ) )
= $true ),
inference(beta_eta_normalization,[],[f114]) ).
thf(f114,plain,
! [X1: mworld] :
( ( ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( class @ second @ Y0 ) )
@ X1 )
= $true ),
inference(pi_clausification,[],[f113]) ).
thf(f113,plain,
( ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( class @ second @ Y0 ) ) )
= $true ),
inference(beta_eta_normalization,[],[f78]) ).
thf(f78,plain,
( $true
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ ( class @ second ) ) ) ),
inference(definition_unfolding,[],[f71,f69,f60]) ).
thf(f71,plain,
( ( mlocal @ ( mbox @ ( class @ second ) ) )
= $true ),
inference(cnf_transformation,[],[f29]) ).
thf(f29,plain,
( ( mlocal @ ( mbox @ ( class @ second ) ) )
= $true ),
inference(fool_elimination,[],[f28]) ).
thf(f28,plain,
mlocal @ ( mbox @ ( class @ second ) ),
inference(rectify,[],[f16]) ).
thf(f16,axiom,
mlocal @ ( mbox @ ( class @ second ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',belief2) ).
thf(f152,plain,
( spl0_1
| spl0_3
| spl0_2 ),
inference(avatar_split_clause,[],[f137,f144,f148,f140]) ).
thf(f137,plain,
( ( ( mrel @ mactual @ sK1 )
= $false )
| ( $false
= ( class @ second @ sK1 ) )
| ( ( dest @ paris @ sK1 )
= $false ) ),
inference(trivial_inequality_removal,[],[f136]) ).
thf(f136,plain,
( ( $true = $false )
| ( ( mrel @ mactual @ sK1 )
= $false )
| ( ( dest @ paris @ sK1 )
= $false )
| ( $false
= ( class @ second @ sK1 ) ) ),
inference(superposition,[],[f105,f91]) ).
thf(f91,plain,
! [X1: mworld] :
( ( $true
= ( price @ seventy @ X1 ) )
| ( $false
= ( dest @ paris @ X1 ) )
| ( $false
= ( class @ second @ X1 ) )
| ( ( mrel @ mactual @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f90]) ).
thf(f90,plain,
! [X1: mworld] :
( ( $true
= ( price @ seventy @ X1 ) )
| ( $false
= ( ( class @ second @ X1 )
& ( dest @ paris @ X1 ) ) )
| ( ( mrel @ mactual @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f89]) ).
thf(f89,plain,
! [X1: mworld] :
( ( $true
= ( ( ( class @ second @ X1 )
& ( dest @ paris @ X1 ) )
=> ( price @ seventy @ X1 ) ) )
| ( ( mrel @ mactual @ X1 )
= $false ) ),
inference(binary_proxy_clausification,[],[f88]) ).
thf(f88,plain,
! [X1: mworld] :
( ( ( mrel @ mactual @ X1 )
=> ( ( ( class @ second @ X1 )
& ( dest @ paris @ X1 ) )
=> ( price @ seventy @ X1 ) ) )
= $true ),
inference(beta_eta_normalization,[],[f87]) ).
thf(f87,plain,
! [X1: mworld] :
( $true
= ( ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( ( ( class @ second @ Y0 )
& ( dest @ paris @ Y0 ) )
=> ( price @ seventy @ Y0 ) ) )
@ X1 ) ),
inference(pi_clausification,[],[f86]) ).
thf(f86,plain,
( $true
= ( !! @ mworld
@ ^ [Y0: mworld] :
( ( mrel @ mactual @ Y0 )
=> ( ( ( class @ second @ Y0 )
& ( dest @ paris @ Y0 ) )
=> ( price @ seventy @ Y0 ) ) ) ) ),
inference(beta_eta_normalization,[],[f76]) ).
thf(f76,plain,
( $true
= ( ^ [Y0: mworld > $o] : ( Y0 @ mactual )
@ ( ^ [Y0: mworld > $o,Y1: mworld] :
( !! @ mworld
@ ^ [Y2: mworld] :
( ( mrel @ Y1 @ Y2 )
=> ( Y0 @ Y2 ) ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) )
@ ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) )
@ ( dest @ paris )
@ ( class @ second ) )
@ ( price @ seventy ) ) ) ) ),
inference(definition_unfolding,[],[f68,f69,f60,f62,f66]) ).
thf(f66,plain,
( mand
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f37]) ).
thf(f37,plain,
( mand
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y1 @ Y2 )
& ( Y0 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f36]) ).
thf(f36,plain,
( ( ^ [X0: mworld > $o,X1: mworld > $o,X2: mworld] :
( ( X0 @ X2 )
& ( X1 @ X2 ) ) )
= mand ),
inference(rectify,[],[f3]) ).
thf(f3,axiom,
( ( ^ [X1: mworld > $o,X3: mworld > $o,X2: mworld] :
( ( X1 @ X2 )
& ( X3 @ X2 ) ) )
= mand ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mand_def) ).
thf(f62,plain,
( mimplies
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ),
inference(cnf_transformation,[],[f47]) ).
thf(f47,plain,
( mimplies
= ( ^ [Y0: mworld > $o,Y1: mworld > $o,Y2: mworld] :
( ( Y0 @ Y2 )
=> ( Y1 @ Y2 ) ) ) ),
inference(fool_elimination,[],[f46]) ).
thf(f46,plain,
( ( ^ [X0: mworld > $o,X1: mworld > $o,X2: mworld] :
( ( X0 @ X2 )
=> ( X1 @ X2 ) ) )
= mimplies ),
inference(rectify,[],[f5]) ).
thf(f5,axiom,
( ( ^ [X1: mworld > $o,X3: mworld > $o,X2: mworld] :
( ( X1 @ X2 )
=> ( X3 @ X2 ) ) )
= mimplies ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',mimplies_def) ).
thf(f68,plain,
( ( mlocal @ ( mbox @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ) )
= $true ),
inference(cnf_transformation,[],[f21]) ).
thf(f21,plain,
( ( mlocal @ ( mbox @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ) )
= $true ),
inference(fool_elimination,[],[f20]) ).
thf(f20,plain,
mlocal @ ( mbox @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ),
inference(rectify,[],[f12]) ).
thf(f12,axiom,
mlocal @ ( mbox @ ( mimplies @ ( mand @ ( dest @ paris ) @ ( class @ second ) ) @ ( price @ seventy ) ) ),
file('/export/starexec/sandbox/benchmark/theBenchmark.p',law2) ).
thf(f105,plain,
( $false
= ( price @ seventy @ sK1 ) ),
inference(binary_proxy_clausification,[],[f104]) ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.12 % Problem : NLP267^4 : TPTP v8.2.0. Released v8.1.0.
% 0.03/0.13 % Command : vampire --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule file --schedule_file /export/starexec/sandbox/solver/bin/quickGreedyProduceRating_steal_pow3.txt --cores 8 -m 12000 -t %d %s
% 0.13/0.34 % Computer : n020.cluster.edu
% 0.13/0.34 % Model : x86_64 x86_64
% 0.13/0.34 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.34 % Memory : 8042.1875MB
% 0.13/0.34 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.34 % CPULimit : 300
% 0.13/0.34 % WCLimit : 300
% 0.13/0.34 % DateTime : Sun May 19 22:02:08 EDT 2024
% 0.13/0.34 % CPUTime :
% 0.13/0.34 This is a TH0_THM_EQU_NAR problem
% 0.13/0.35 Running vampire_ho --input_syntax tptp --proof tptp --output_axiom_names on --mode portfolio --schedule snake_tptp_hol --cores 8 -m 12000 -t 300 /export/starexec/sandbox/benchmark/theBenchmark.p
% 0.21/0.36 % (4757)lrs+10_1:1_bet=on:cnfonf=off:fd=off:hud=5:inj=on:i=3:si=on:rtra=on_0 on theBenchmark for (2999ds/3Mi)
% 0.21/0.36 % (4757)Instruction limit reached!
% 0.21/0.36 % (4757)------------------------------
% 0.21/0.36 % (4757)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.36 % (4757)Termination reason: Unknown
% 0.21/0.36 % (4757)Termination phase: Property scanning
% 0.21/0.36
% 0.21/0.36 % (4757)Memory used [KB]: 1023
% 0.21/0.36 % (4757)Time elapsed: 0.003 s
% 0.21/0.36 % (4757)Instructions burned: 3 (million)
% 0.21/0.36 % (4757)------------------------------
% 0.21/0.36 % (4757)------------------------------
% 0.21/0.36 % (4751)lrs+10_1:1_c=on:cnfonf=conj_eager:fd=off:fe=off:kws=frequency:spb=intro:i=4:si=on:rtra=on_0 on theBenchmark for (2999ds/4Mi)
% 0.21/0.36 % (4750)lrs+1002_1:8_bd=off:fd=off:hud=10:tnu=1:i=183:si=on:rtra=on_0 on theBenchmark for (2999ds/183Mi)
% 0.21/0.36 % (4753)lrs+10_1:1_au=on:inj=on:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.36 % (4752)dis+1010_1:1_au=on:cbe=off:chr=on:fsr=off:hfsq=on:nm=64:sos=theory:sp=weighted_frequency:i=27:si=on:rtra=on_0 on theBenchmark for (2999ds/27Mi)
% 0.21/0.36 % (4754)lrs+1002_1:128_aac=none:au=on:cnfonf=lazy_not_gen_be_off:sos=all:i=2:si=on:rtra=on_0 on theBenchmark for (2999ds/2Mi)
% 0.21/0.36 % (4755)lrs+1002_1:1_au=on:bd=off:e2e=on:sd=2:sos=on:ss=axioms:i=275:si=on:rtra=on_0 on theBenchmark for (2999ds/275Mi)
% 0.21/0.36 % (4756)lrs+1004_1:128_cond=on:e2e=on:sp=weighted_frequency:i=18:si=on:rtra=on_0 on theBenchmark for (2999ds/18Mi)
% 0.21/0.36 % (4754)Instruction limit reached!
% 0.21/0.36 % (4754)------------------------------
% 0.21/0.36 % (4754)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.36 % (4754)Termination reason: Unknown
% 0.21/0.36 % (4754)Termination phase: shuffling
% 0.21/0.36
% 0.21/0.36 % (4754)Memory used [KB]: 895
% 0.21/0.36 % (4754)Time elapsed: 0.003 s
% 0.21/0.36 % (4754)Instructions burned: 2 (million)
% 0.21/0.36 % (4754)------------------------------
% 0.21/0.36 % (4754)------------------------------
% 0.21/0.37 % (4753)Instruction limit reached!
% 0.21/0.37 % (4753)------------------------------
% 0.21/0.37 % (4753)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (4753)Termination reason: Unknown
% 0.21/0.37 % (4753)Termination phase: Property scanning
% 0.21/0.37
% 0.21/0.37 % (4753)Memory used [KB]: 1023
% 0.21/0.37 % (4753)Time elapsed: 0.004 s
% 0.21/0.37 % (4753)Instructions burned: 3 (million)
% 0.21/0.37 % (4753)------------------------------
% 0.21/0.37 % (4753)------------------------------
% 0.21/0.37 % (4751)Instruction limit reached!
% 0.21/0.37 % (4751)------------------------------
% 0.21/0.37 % (4751)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (4751)Termination reason: Unknown
% 0.21/0.37 % (4751)Termination phase: Saturation
% 0.21/0.37
% 0.21/0.37 % (4751)Memory used [KB]: 5500
% 0.21/0.37 % (4755)Refutation not found, incomplete strategy
% 0.21/0.37 % (4755)------------------------------
% 0.21/0.37 % (4755)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.37 % (4755)Termination reason: Refutation not found, incomplete strategy
% 0.21/0.37
% 0.21/0.37
% 0.21/0.37 % (4755)Memory used [KB]: 5500
% 0.21/0.37 % (4755)Time elapsed: 0.004 s
% 0.21/0.37 % (4755)Instructions burned: 3 (million)
% 0.21/0.37 % (4755)------------------------------
% 0.21/0.37 % (4755)------------------------------
% 0.21/0.37 % (4751)Time elapsed: 0.005 s
% 0.21/0.37 % (4751)Instructions burned: 5 (million)
% 0.21/0.37 % (4751)------------------------------
% 0.21/0.37 % (4751)------------------------------
% 0.21/0.37 % (4758)lrs+1002_1:1_cnfonf=lazy_not_be_gen:hud=14:prag=on:sp=weighted_frequency:tnu=1:i=37:si=on:rtra=on_0 on theBenchmark for (2999ds/37Mi)
% 0.21/0.37 % (4750)First to succeed.
% 0.21/0.37 % (4756)Also succeeded, but the first one will report.
% 0.21/0.38 % (4750)Refutation found. Thanks to Tanya!
% 0.21/0.38 % SZS status Theorem for theBenchmark
% 0.21/0.38 % SZS output start Proof for theBenchmark
% See solution above
% 0.21/0.38 % (4750)------------------------------
% 0.21/0.38 % (4750)Version: Vampire 4.8 HO - Sledgehammer schedules (2023-10-19)
% 0.21/0.38 % (4750)Termination reason: Refutation
% 0.21/0.38
% 0.21/0.38 % (4750)Memory used [KB]: 5628
% 0.21/0.38 % (4750)Time elapsed: 0.012 s
% 0.21/0.38 % (4750)Instructions burned: 11 (million)
% 0.21/0.38 % (4750)------------------------------
% 0.21/0.38 % (4750)------------------------------
% 0.21/0.38 % (4749)Success in time 0.012 s
% 0.21/0.38 % Vampire---4.8 exiting
%------------------------------------------------------------------------------